Truth discovery on inconsistent relational data

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discovery of Data Dependencies in Relational Databases

REFERENCES 17 times faster than Schlimmer's algorithm. Even without any bound on the length of the FDs it is still eight times faster and it uses a database. We conjecture, that this interesting but also unexpected result is mainly caused by the distinction between the three types of attributes in the search for functional dependencies. But of course the two domains above are not typical databa...

متن کامل

Discovery of Data Dependencies in Relational Databases

Since real world databases are known to be very large, they raise problems of the access. Therefore, real world databases onlycan be accessed by database management systems and the number of accesses has to be reduced to a minimum. Considering this property, we are forced to use standard set–oriented interfaces of relational database management systems. We present a system for discovering data ...

متن کامل

Interesting Instance Discovery in Multi-Relational Data

The general area of machine discovery focuses on methods to use computers to perform or assist discovery tasks. Herbert Simon described it as “gradual problemsolving processes of searching large problem spaces for incompletely defined goal objects” [Simon, 1995, p.171]. Today machine discovery research falls into two major categories, scientific discovery and knowledge discovery and data mining...

متن کامل

Truth Discovery: CoTruth

. More and more people choose to obtain news online in today’s world. However, in recent times, there exists many fake claims on web. Rumor detection has been a popular topic. Recent search on truth discovery still doesn’t satisfy the realistic requirments now. As most of them focus on structured data, others proposed a new method to detect fake news with unstructured data. That is combine sour...

متن کامل

Preference-Driven Querying of Inconsistent Relational Databases

One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this specification is incomplete, and the cleaned database may still be inconsistent. At the same time, data cleaning is a rather drastic approach to conflict resolution: It removes tuples from the database, which may lead to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tsinghua Science and Technology

سال: 2018

ISSN: 1007-0214

DOI: 10.26599/tst.2018.9010004